Planar emulators conjecture is nearly true for cubic graphs
نویسندگان
چکیده
We prove that a cubic nonprojective graph cannot have a finite planar emulator, unless one of two very special cases happen (in which the answer is open). This shows that Fellows’ planar emulator conjecture, disproved for general graphs by Rieck and Yamashita in 2008, is nearly true on cubic graphs, and might very well be true there definitely.
منابع مشابه
Tutte's Edge-Colouring Conjecture
Tutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Petersen graph as a minor is 3-edge-colourable. The conjecture is still open, but we show that it is true in general provided it is true for two special kinds of cubic graphs that are almost planar.
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملPerfect matchings in planar cubic graphs
A well-known conjecture of Lovász and Plummer from the mid-1970’s, still open, asserts that for every cubic graph G with no cutedge, the number of perfect matchings in G is exponential in |V (G)|. In this paper we prove the conjecture for planar graphs; we prove that if G is a planar cubic graph with no cutedge, then G has at least 2 (G)|/655978752
متن کاملRigidity-Theoretic Constructions of Integral Fary Embeddings
Fáry [3] proved that all planar graphs can be drawn in the plane using only straight line segments. Harborth et al. [7] ask whether or not there exists such a drawing where all edges have integer lengths, and Geelen et al. [4] proved that cubic planar graphs satisfied this conjecture. We re-prove their result using rigidity theory, exhibit other natural families of planar graphs that satisfy th...
متن کاملErdös-Gyárfás Conjecture for Cubic Planar Graphs
In 1995, Paul Erdős and András Gyárfás conjectured that for every graph of minimum degree at least 3, there exists a non-negative integer m such that G contains a simple cycle of length 2m. In this paper, we prove that the conjecture holds for 3-connected cubic planar graphs. The proof is long, computer-based in parts, and employs the Discharging Method in a novel way.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 48 شماره
صفحات -
تاریخ انتشار 2015